Optimization methods for nesting problems

نویسندگان

  • Mattijs Timmerman
  • Fredrik Danielsson
چکیده

Nesting problems have been present for as long as mankind exists. Present days these problems occur in many different industries, e.g. textile, paper, wood, metal and glass industry. These industries produce massive amounts of products to answer the global demand. To minimize the material waste making these products, a good cutting and packing layout is beneficial. The last three decades, researchers have focused on developing methods to solve these problems through computing, instead of solving them manually. Many possible solutions have been found, each method focusing on the specifications of the problem. This thesis had two sub-objectives. The first one was to find the best method for nesting optimization, by doing an intensive literature study. The second sub-objective was to work with a previous made program that is capable of doing optimization tests, containing a nesting optimization method, and try to improve this method to get better results, using the literature study. At a certain point in this project, based on the progress of the literature study and knowledge acquired on the in-house developed program, a decision had to be made either to continue with the previous developed method or to try a new method. A lot of ideas from the literature where used and implemented to improve the method leading to improving results. Hence, the choice was made to continue working with the previous developed method. A new placement strategy was introduced in the program. Additional program code to improve stencil evaluation was added. A proper user interface was created. At the end of this project, a nesting optimization method was obtained, capable of producing a feasible solution when solving a nesting problem, within a reasonable amount of time. Programme: Master Programme in Robotics Main field of study: Automation with a specialization in industrial robotics iii Preface When I started this project, I had no idea what the subject was about and how to solve the objectives for this project. Fortunately there is a wide range of articles available that helped me in that search. I would like to thank University West for making these resources available. Because of the huge amount of available information containing the nesting problem and the new software I had to master, a lot of choices had to be made on which would be the next step in the project and how much time had to be spend on certain points in the project. …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Constraint Logic Programming to the Resolution of Nesting Problems

Nesting problems are combinatorial optimisation problems where one or more pieces of material or space must be divided into smaller irregular pieces, minimising the waste. In OR, the state-of-the-art in nesting problems is to solve them by means of heuristic algorithms; the use of mixed integer programming models can handle only rather small instances. The satisfaction of geometric constraints ...

متن کامل

Solving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming

In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in which the pieces generally have non-convex shapes. Due to their combinatorial optimization nature, nesting problems have traditionally been tackled by heuristics and in the recent past by meta-heuristic...

متن کامل

Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management

Virtual nesting is a popular capacity control strategy in network revenue management. (See Smith et al. [36].) In virtual nesting, products (itinerary-fare-class combinations) are mapped (\indexed") into a relatively small number of \virtual classes" on each resource (°ight leg) of the network. Nested protection levels are then used to control the availability of these virtual classes; speci ̄ca...

متن کامل

Simulation-Based Optimization

Virtual nesting is a popular capacity control strategy in network revenue management. In virtual nesting, products (itineraryfare-class combinations) are mapped (“indexed”) into a relatively small number of “virtual classes” on each resource (flight leg) of the network. Nested protection levels are then used to control the availability of these virtual classes; specifically, a product request i...

متن کامل

Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm

In layout design problems including blank nesting, the positions and directions of layout elements must be determined so as to minimize the total space. It is difficult and computationally time-consuming to find the optimal solution for such layout problems, because they include a lot of underlying combinational conditions. In this paper, we present an approach for optimal nesting by combining ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013